Supercompiler HOSC: proof of correctness
نویسنده
چکیده
The paper presents the proof of correctness of an experimental supercompiler HOSC dealing with higher-order functions. В работе приводится доказательство корректности экспериментального суперкомпилятора HOSC, работающего с функциями высших порядков.
منابع مشابه
Keldysh Institute preprints • Preprint No . 31 , 2010
The paper presents the proof of correctness of an experimental supercompiler HOSC dealing with higher-order functions. В работе приводится доказательство корректности экспериментального суперкомпилятора HOSC, работающего с функциями высших порядков.
متن کاملSupercompiler HOSC 1.1: proof of termination
The paper contributes the proof of termination of an experimental supercom-piler HOSC dealing with higher-order functions. В работе приводится доказательство завершаемости экпериментального суперкомпилятора HOSC, работающего с функциями высших порядков.
متن کاملProperty-based testing and properties as types : a hybrid approach to supercompiler verification
This thesis describes a hybrid approach to compiler verification. Property-based testing and mechanised proof are combined to support the verification of a supercompiler — a particular source-to-source program optimisation. A careful developer may use formal methods to ensure that their program code is correct to specifications. Poorly constructed compilers (and their associated machinery) can ...
متن کاملA Simple Supercompiler Formally Verified in Coq
We study an approach for verifying the correctness of a simplified supercompiler in Coq. While existing supercompilers are not very big in size, they combine many different program transformations in intricate ways, so checking the correctness of their implementation poses challenges. The presented method relies on two important technical features to achieve a compact and modular formalization:...
متن کاملKELDYSH INSTITUTE OF APPLIED MATHEMATICS Russian Academy of Sciences
TT Lite: a supercompiler for Martin-Löf 's type theory Moscow 2013 Ilya G. Klyuchnikov, Sergei A. Romanenko. TT Lite: a supercom-piler for Martin-Löf 's type-theory The paper describes the design and implementation of a certifying supercom-piler TT Lite, which takes an input program and produces a residual program paired with a proof of the fact that the residual program is equivalent to the in...
متن کامل